Whitney Numbers for Poset Cones
نویسندگان
چکیده
Hyperplane arrangements dissect $\mathbb {R}^{n}$ into connected components called chambers, and a well-known theorem of Zaslavsky counts chambers as sum nonnegative integers Whitney numbers the first kind. His generalizes to count within any cone defined intersection collection halfspaces from arrangement, leading notion for each cone. This paper focuses on cones braid consisting reflecting hyperplanes xi = xj inside symmetric group, thought type An− 1 reflection group. Here, We interpret this refinement all posets counting linear extensions according statistic that number left-to-right maxima permutation. When poset is disjoint union chains, we differently, using Foata’s theory cycle decomposition multiset permutations, simple generating function compiling these numbers.
منابع مشابه
Prefab posets' Whitney numbers
We introduce a natural partial order ≤ in structurally natural finite subsets the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers' triangular array-are then calculated and the explicit formula for them is provided. Next-in the second construction-we endow the set sums of prefa...
متن کاملTranslated Whitney and r-Whitney Numbers: A Combinatorial Approach
Using a combinatorial approach, we introduce the translated Whitney numbers. This seems to be more natural than to write a product of anarithmetical progression in terms of a power variable and conversely. We also extend our ideas to translated r-Whitney numbers of both kinds and to translated Whitney-Lah numbers.
متن کاملDimension-2 poset competition numbers and dimension-2 poset double competition numbers
LetD = (V (D), A(D)) be a digraph. The competition graph ofD, is the graphwith vertex set V (D) and edge set {uv ∈ ( V (D) 2 ) : ∃w ∈ V (D), uw, vw ∈ A(D)}. The double competition graph of D, is the graph with vertex set V (D) and edge set {uv ∈ ( V (D) 2 )
متن کاملFirst Observations on Prefab Posets Whitney Numbers
We introduce a natural partial order ≤ in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers‘ triangular array are then calculated and the explicit formula for them is provided. Next in the second construction we endow the set sums of pr...
متن کاملPoset , competition numbers , and interval graph ∗
Let D = (V (D), A(D)) be a digraph. The competition graph of D, is the graph with vertex set V (D) and edge set {uv ∈ `V (D) 2 ́ : ∃w ∈ V (D),−→ uw,−→ vw ∈ A(D)}. The double competition graph of D, is the graph with vertex set V (D) and edge set {uv ∈ `V (D) 2 ́ : ∃w1, w2 ∈ V (D),−−→ uw1,−−→ vw1,−−→ w2u,−−→ w2v ∈ A(D)}. A poset of dimension at most two is a digraph whose vertices are some points ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2021
ISSN: ['1572-9273', '0167-8094']
DOI: https://doi.org/10.1007/s11083-020-09541-4